Classifying complements for associative algebras

Continuous classifying associative memory

In this article we present the so-called continuous classifying associative memory, able to store continuous patterns avoiding the problems of spurious states and data dependency. This is a memory model based on our previously developed classifying associative memory, which enables continuous patterns to be stored and recovered. We will also show that the behavior of this continuous classifying...

Schur Complements in C∗− Algebras

The formula (1) was first used by Schur [22], but the idea of the Schur complement goes back to Sylvester (1851), and the term Schur complement was introduced by E. Haynsworth [16]. In the beginning Schur complements were used in the theory of matrices. M.G. Krein [19] and W.N. Anderson and G.E. Trapp [4] extended the notion of Schur complements of matrices to shorted operators in Hilbert space...

Identities of Associative Algebras

The structure theory for Pi-algebras is well developed. Some results of this theory are classic now. One of them is Kaplansky's theorem which asserts that a primitive Pi-algebra is finite dimensional over its centre. Another example is the theorem of Nagata-Higman which asserts that any algebra over a field of zero characteristic satisfying identity x" = 0 is nilpotent. In 1957 A.I. Shirshov pr...

Non Associative Linear Algebras

Non-associative algebras associated to Poisson algebras

Poisson algebras are usually defined as structures with two operations, a commutative associative one and an anti-commutative one that satisfies the Jacobi identity. These operations are tied up by a distributive law, the Leibniz rule. We present Poisson algebras as algebras with one operation, which enables us to study them as part of non-associative algebras. We study the algebraic and cohomo...